An Algorithm for Generating Anti - Aliased Polygons for 3 - D Applications

نویسنده

  • Grant Bechthold
چکیده

An algorithm for generating anti-aliased polygons is described. The algorithm is simple, but powerful, combining color blending, Gouraud shading and Z-buffer hidden surface removal. A test bed has been constructed which consists of a Versabus M68000 computer (the graphics processor) and a custom interface between the M68000 and the frame buffer of a raster display. Written in "C", the package for generating anti-aliased polygons performs all calculations on a line segment basis rather than pixel basis. This requires less memory and can thus be moved to smaller systems. The prototype test results indicate that a higher graphics performance can be achieved on inexpensive systems by this algorithm and implementation. This paper also suggests an alternative to the Red/Green/Blue color representation normally used in color displays by storing intensity and two normalized color components to simplify the calculation involved in anti-aliasing, color blending and shading.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Shape Representation: Transforming Polygons into Voxels

We developed a method that transforms a polygonal representation of an object into a voxel representation on a 3D regular grid. By applying scale-space theory we derived expressions for an anti-aliased voxel representation of points, lines, and triangles. The algorithm ‘paints’ the triangles on the voxel grid and ‘fills’ the resulting surface. The method can be applied in 3D (medical) imaging a...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

Texture Mapping as a Fundamental Drawing Primitive

Texture mapping has traditionally been used to add realism to computer graphics images. In recent years, this technique has moved from the domain of software rendering systems to that of high performance graphics hardware. But texture mapping hardware can be used for many more applications than simply applying diffuse patterns to polygons. Wesurvey applications of texturemapping including simpl...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

Generating Sunflower Random Polygons on a Set of Vertices

Abstract Generating random polygons problem is important for verification of geometric algorithms. Moreover, this problem has applications in computing and verification of time complexity for computational geometry algorithms such as Art Gallery. Since it is often not possible to get real data, a set of random data is a good alternative. In this paper, a heuristic algorithm is proposed for gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015